On the Convergence of the Gaver-Stehfest Algorithm
نویسنده
چکیده
The Gaver–Stehfest algorithm for numerical inversion of Laplace transform was developed in the late 1960s. Due to its simplicity and good performance it is becoming increasingly more popular in such diverse areas as geophysics, operations research and economics, financial and actuarial mathematics, computational physics, and chemistry. Despite the large number of applications and numerical studies, this method has never been rigorously investigated. In particular, it is not known whether the Gaver–Stehfest approximations converge or what the rate of convergence is. In this paper we answer the first of these two questions: We prove that the Gaver–Stehfest approximations converge for functions of bounded variation and functions satisfying an analogue of Dini criterion.
منابع مشابه
Sampling Archimedean copulas
This paper addresses the problem of efficiently sampling exchangeable and nested Archimedean copulas, with specific focus on large dimensions, where methods involving generator derivatives, such as the conditional distribution method, are not applicable. Additionally, new conditions under which Archimedean copulas can be mixed to construct nested Archimedean copulas are presented. Moreover, for...
متن کاملEfficient pricing options under regime switching
In the paper, we propose two new efficient methods for pricing barrier option in wide classes of Lévy processes with/without regime switching. Both methods are based on the numerical Laplace transform inversion formulae and the Fast Wiener-Hopf factorization method developed in Kudryavtsev and Levendorskǐi (Finance Stoch. 13: 531–562, 2009). The first method uses the Gaver-Stehfest algorithm, t...
متن کاملAmerican Fractional Lookback Options: Valuation and Premium Decomposition
This paper deals with valuation and premium decomposition of American floatingstrike lookback options written on dividend-paying assets, for which exact formulas are unknown except for the perpetual case. Via a PDE approach, we derive Laplace transforms of the values of lookback call and put options, which can be decomposed as the associated European values plus the early exercise premiums. Usi...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 51 شماره
صفحات -
تاریخ انتشار 2013